package dp_algorithm.leetcode.medium;

/**
 * @author bruin_du
 * @description 礼物的最大价值
 * @date 2022/5/24 16:23
 **/
public class Offer47_MaxValue {
    public int maxValue(int[][] grid) {
        int row = grid.length,col = grid[0].length;
        int[][] dp = new int[row + 1][col + 1];
        for (int i = 1; i <= row; i++) {
            for (int j = 1; j <= col; j++) {
                dp[i][j] = Math.max(dp[i - 1][j],dp[i][j - 1]) + grid[i - 1][j - 1];
            }
        }
        return dp[row][col];
    }
}
